Stereo Matching Using Population-Based MCMC

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallel Trellis Based Stereo Matching Using Constraints

We present a new center-referenced basis for representation of stereo correspondence that permits a more natural, complete and concise representation of matching constraints. In this basis, which contains new occlusion nodes, natural constrainsts are applied in the form of a trellis. A MAP disparity estimate is found using DP methodsin the trellis. Like other DP methods, the computational load ...

متن کامل

Feature-Based Stereo Matching Using Graph Cuts

In this paper, we present a novel feature point based stereo matching algorithm with global energy minimization. The initial disparity map is estimated by considering matching SURF key points between two images inside each homogeneous colour region by an adaptive box matching approach. Next, we improve the initial disparity map with a RANSAC based plane fitting technique which relies on accurac...

متن کامل

Mcmc-based Peak Template Matching for Gcxgc

Comprehensive two-dimensional gas chromatography (GCxGC) is a new technology for chemical separation. Peak template matching is a technique for automatic chemical identification in GCxGC analysis. Peak template matching can be formulated as a Largest Common Point Set problem (LCP). Minimizing Hausdorff distances is one of the many techniques proposed for solving the LCP problem. This paper prop...

متن کامل

Stereo Matching Using Optic Flow

A method for the determination of pixel correspondence in stereo image pairs is presented. The optic ̄ow vectors that result from the displacement of the point of projection are obtained and the correspondence between pixels of the various objects in the scene is derived from the optic ̄ow vectors. The proposed algorithm is implemented and the correspondence vectors are obtained. Various speciali...

متن کامل

Stereo Matching Using Belief Propagation

In this paper, we formulate the stereo matching problem as a Markov network and solve it using Bayesian belief propagation. The stereo Markov network consists of three coupled Markov random fields that model the following: a smooth field for depth/disparity, a line process for depth discontinuity, and a binary process for occlusion. After eliminating the line process and the binary process by i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Computer Vision

سال: 2008

ISSN: 0920-5691,1573-1405

DOI: 10.1007/s11263-008-0189-6